Open-source approaches for location cover models: capabilities and efficiency

Maximum-Cover Source-Location Problems

Given a graph G = (V, E), a set of vertices S ⊆ V covers v ∈ V if the edge connectivity between S and v is at least a given number k. Vertices in S are called sources. The source location problem is a problem of finding a minimum-size source set covering all vertices of a given graph. This paper presents a new variation of the problem, called maximum-cover source-location problem, which finds a...

Leveraging Open Source Licenses and Open Source Communities in Hybrid Commercial Open Source Business Models

The general research idea behind this work is that a framework can be created to describe commercial open source business models as combinations of different criteria. Goal of this paper is to find and describe the criteria by answering the question how software vendors leverage open source software and open source communities as well as multiproduct and multilicense strategies in commercial op...

Emerging business models for open source hardware

An Open-source Web Architecture for Adaptive Location-based Services

As the volume of information available online continues to grow, there is an increasing problem with information overload. This issue is also escalating in the spatial domain as the amount of geo-tagged information expands. With such an abundance of geo-information, it is difficult for map users to find content that is relevant to them. The problem is intensified when considering Location-Based...

Molecubes Extended: Diversifying Capabilities of Open-Source Modular Robotics

This paper presents an open hardware and software platform for modular robotics (Molecubes). The goal of this project is to share the practice of design and construction of modular robotic systems with an emphasis on an expandable, open-architecture system made of standard components at reasonable costs. We present several different types of active modules including a controller, actuated joint...